Binary Computer-Generated Holograms by Simulated-Annealing Binary Search
نویسندگان
چکیده
The binary computer-generated hologram (BCGH) has attracted much attention recently because it can address the high-speed spatial light modulator (SLM), such as a digital micromirror device (DMD) SLM. In this paper, our concern is development of an algorithm to produce high-quality BCGHs. particular, simulated annealing (SA) efficient used phase-only hologram. study SA for production BCGH, we found some inherent shortcomings SA, and quality produced BCGHs limited. Accordingly, have modified propose simulated-annealing search (SABS) algorithm. We also proposed method quickly determine parameters SABS. comparison with mean square error SABS decreases by 32% on average. Therefore, promising technique holographic display DMD.
منابع مشابه
Analysis of phase sensitivity for binary computer-generated holograms.
A binary diffraction model is introduced to study the sensitivity of the wavefront phase of binary computer-generated holograms on groove depth and duty-cycle variations. Analytical solutions to diffraction efficiency, diffracted wavefront phase functions, and wavefront sensitivity functions are derived. The derivation of these relationships is obtained by using the Fourier method. Results from...
متن کاملReconstruction of Binary Matrices Satisfying Neighborhood Constraints by Simulated Annealing
This paper considers the NP-hard problem of reconstructing binary matrices satisfying exactly-1-4-adjacency constraint from its row and column projections. This problem is formulated into a maximization problem. The objective function gives a measure of adjacency constraint for the binary matrices. The maximization problem is solved by the simulated annealing algorithm and experimental results ...
متن کاملNonlinear computer-generated holograms.
We propose a novel technique for arbitrary wavefront shaping in quadratic nonlinear crystals by introducing the concept of computer-generated holograms (CGHs) into the nonlinear optical regime. We demonstrate the method experimentally showing a conversion of a fundamental Gaussian beam pump light into the first three Hermite-Gaussian beams at the second harmonic in a stoichiometric lithium tant...
متن کاملSimulated Binary Crossover for Continuous Search Space
Abst ract . T he success of binary-coded gene t ic algorithms (GA s) in problems having discrete sear ch space largely depends on the coding used to represent the prob lem var iables and on the crossover ope ra tor that propagates buildin g blocks from parent strings to children st rings . In solving optimization problems having continuous search space, binary-coded GAs discr et ize the search ...
متن کاملNew bounds for binary covering arrays using simulated annealing
Covering arrays (CAs) are combinatorial structures specified as a matrix of N rows and k columns over an alphabet on v symbols such that for each set of t columns (called the strength of the array) every t-tuple of symbols is covered. Recently they have been used to represent interaction test suites for software testing given that they provide economical sized test cases while still preserving ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Photonics
سال: 2022
ISSN: ['2304-6732']
DOI: https://doi.org/10.3390/photonics9080581